Indexing Keys in Hierarchical Data
نویسندگان
چکیده
Building on a notion of keys for XML, we propose a novel indexing scheme for hierarchical data that is based not only on the structure but also the content of the data. The index can be used to check the validity of data with respect to a set of key specifications, as well as for efficiently evaluating queries and updates on key paths. We develop algorithms for the construction and incremental maintenance of the indexing structure, and study the complexity of these algorithms. Finally, we discuss how our indexing techniques can be used for more general queries involving key paths. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-01-30. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/46 Indexing Keys in Hierarchical Data Yi Chen, Susan B. Davidson and Yifeng Zheng
منابع مشابه
یک روش مبتنی بر خوشهبندی سلسلهمراتبی تقسیمکننده جهت شاخصگذاری اطلاعات تصویری
It is conventional to use multi-dimensional indexing structures to accelerate search operations in content-based image retrieval systems. Many efforts have been done in order to develop multi-dimensional indexing structures so far. In most practical applications of image retrieval, high-dimensional feature vectors are required, but current multi-dimensional indexing structures lose their effici...
متن کاملHiding Approach for Efficient Image Indexing
In this letter, we propose a data hiding approach to embed the indexing keys inside the JPEG compressed images for their retrieval, inspired from the spirit of digital watermarking. At the stage of database population, the existing approach is to compress all images by standard JPEG in order to save their storage space, but ignored the compression of their indexing keys under the notion that th...
متن کاملA Query-Adaptive Partial Distributed Hash Table for Peer-to-Peer Systems
The two main approaches to find data in peer-to-peer (P2P) systems are unstructured networks using flooding and structured networks using a distributed index. A distributed index is usually built over all keys that are stored in the network whether they are queried or not. Indexing all keys is no longer feasible when indexing metadata, as the key space becomes very large. Here we need a query-a...
متن کاملEnforcing RBAC Policies over Data Stored on Untrusted Server (Extended Version)
One of the security issues in data outsourcing is the enforcement of the data owner’s access control policies. This includes some challenges. The first challenge is preserving confidentiality of data and policies. One of the existing solutions is encrypting data before outsourcing which brings new challenges; namely, the number of keys required to access authorized resources, efficient policy u...
متن کاملTo Lock, Swap, or Elide: On the Interplay of Hardware Transactional Memory and Lock-Free Indexing
The release of hardware transactional memory (HTM) in commodity CPUs has major implications on the design and implementation of main-memory databases, especially on the architecture of highperformance lock-free indexing methods at the core of several of these systems. This paper studies the interplay of HTM and lockfree indexing methods. First, we evaluate whether HTM will obviate the need for ...
متن کامل